New Idea of Proving the Lower Bound of Ramsey Number 关于Ramsey数下界的一个证明思路
Ramsey Number about Tripartite 3-Graph 关于3部3一致超图的Ramsey数
Ramsey is still searching for full fitness after returning from a long lay-off and was frustrated by a number of postponements during a month-long spell at Nottingham Forest at the turn of the year. 受长期缺阵以及岁末年初在诺丁汉森林一个月租借期间数次比赛延期的阻挠,拉姆西仍然在寻找最佳状态。
According to the pluralist view of interpretation of probability, represented by Ramsey, Carnap and D. Gillies, the mathematical calculus has a number of different interpretations and each of them is valid in a particular area or context. 按照概率解释的多元论观点,概率演算具有许多不同的解释,并且每一种解释都是在特定的领域或情况下有效。
Ramsey theory is an important subdiscipline of Discrete Mathematics, and graph Ramsey number is a main branch of Ramsey theory. Ramsey理论是离散数学的一个重要分支,而图的Ramsey数研究是Ramsey理论的一个主要研究方向。
A Property of Ramsey Number Ramsey数的一个性质
The basic character of prime number order cycle graph was studied by the method of construction, and me new lower bounds about some Ramsey numbers were obtained. 用构造性的方法研究了素数阶循环圈的基本性质,得到若干Ramsey数的新的下界。
The algorithm for lower bounds of classic Ramsey number 经典Ramsey数下界的计算机算法
On Ramsey Number about Even Wheels 关于偶数轮的Ramsey数
F. P. Ramsey discovered that when second-order logic is applied to a scien-tific theory ( T) which contains a finite number of axioms, the theoretical terms in T can be removed. F·P·Ramsey(拉姆西)发现,应用二阶逻辑对一个有有限数目公理的科学理论T而言,T中的理论性词项可以被消除。
A new prime order cyclic graph are structured, so lower bound of Ramsey number isobtained: R ( 4, 23) ≥ 272. 本文构造了1个新的素数阶循环圈,从而得到了1个Ramsey数的下界:R(4,23)≥272。
Research on Ramsey Number of Some Graphs 若干图的Ramsey数研究
Ramsey theory constitutes the main research area of graph theory, and 3-coloring Ramsey theory is an important branch of Ramsey theory, the determination of 3-coloring Ramsey number is also an important research direction of Ramsey theory, and it is meanwhile a No-Polynomial Problem. Ramsey理论是图论的重要研究内容之一,而3色Ramsey数理论是其中一个重要的理论分支,对于3色Ramsey数的确定也是一个重要的研究方向,属于NP困难问题。
The Mixed Ramsey Numbers: Total Chromatic Number Versus Small Paths 全色数与小阶路的混合Ramsey数
Ramsey number problem is one that is quite hard to solve. Ramsey数的求解是当前科学极难解决的问题之一。
In chapter five the problem of solving the Ramsey number is transformated to DNA computing models to solve maximum clique and maximum independent set problems. 在第五章中把求解Ramsey数问题转化为求解最大团问题和最大独立集问题,然后利用DNA模型进行解决。